Logic Programming over Polymorphically Order-Sorted Types
نویسنده
چکیده
This thesis presents the foundations for relational logic programming over polymorphically order-sorted data types. This type discipline combines the notion of parametric polymorphism, which has been developed for higher-order functional programming, with the notion of order-sorted typing, which has been developed for equational rst-order speci cation and programming. Polymorphically order-sorted types are obtained as canonical models of a class of speci cations in a suitable logic accommodating sort functions. Algorithms for constraint solving, type checking and type inference are given and proven correct.
منابع مشابه
The completeness of logic programming with sort predicates
An order-sorted logic can be regarded as a generalized first-order predicate logic that includes many and ordered sorts (i.e. a sort-hierarchy). In the fields of knowledge representation and AI, this logic with sort-hierarchy has been used to design a logic-based language appropriate for representing taxonomic knowledge. By incorporating the sort-hierarchy, order-sorted resolution and sorted lo...
متن کاملType Inferencing for Polymorphic Order-Sorted Logic Programs
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if one does not employ the full power of the used type systems. We present a complete type inferencing algorithm that covers the polymorphic order-sorted types in PROTOS-L, a logic programming language that allows for po...
متن کاملKnowledge Representation, Computation, and Learning in Higher-order Logic
This paper contains a systematic study of the foundations of knowledge representation, computation, and learning in higher-order logic. First, a polymorphically-typed higher-order logic, whose origins can be traced back to Church’s simple theory of types, is presented. A model theory and proof theory for this logic are developed and basic theorems relating these two are given. A metric space of...
متن کاملTypability and Type Checking in the Second-Order -Calculus Are Equivalent and Undecidable
Girard and Reynolds independently invented the second-order polymorphically typed lambda calculus, known as System F, to handle problems in logic and computer programming language design, respectively. Viewing F in the Curry style, which associates types with untyped lambda terms, raises the questions of typability and type checking. Typability asks for a term whether there exists some type it ...
متن کاملModels and Equality for Logical Programming
1 I n t r o d u c t i o n This paper argues that some very significant benefits are available to logic programming from using certain concepts from first order model theory, namely: • order-sorted logic and models; • initial models; • interpretation into rLxed models for certain fLxed sorts, functions and relations; and • true semantic equality. These techniques, which are all standard in the t...
متن کامل